Geodetic sets and Steiner sets in graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs

Let G be a connected graph and S ⊆ V (G). Then the Steiner distance of S, denoted by dG(S), is the smallest number of edges in a connected subgraph of G containing S. Such a subgraph is necessarily a tree called a Steiner tree for S. The Steiner interval for a set S of vertices in a graph, denoted by I (S) is the union of all vertices that belong to some Steiner tree for S. If S = {u, v}, then ...

متن کامل

Geodetic Sets in Graphs

Geodetic sets in graphs are briefly surveyed. After an overview of earlier results, we concentrate on recent studies of the geodetic number and related invariants in graphs. Geodetic sets in Cartesian products of graphs and in median graphs are considered in more detail. Algorithmic issues and relations with several other concepts, arising from various convex and interval structures in graphs, ...

متن کامل

Geodetic sets in graphs

For two vertices u and v of a graph G, the closed interval I[u, v] consists of u, v, and all vertices lying in some u − v geodesic in G. If S is a set of vertices of G, then I[S] is the union of all sets I[u, v] for u, v ∈ S. If I[S] = V (G), then S is a geodetic set for G. The geodetic number g(G) is the minimum cardinality of a geodetic set. A set S of vertices in a graph G is uniform if the ...

متن کامل

Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs

A Steiner tree for a set S of vertices in a connected graph G is a connected subgraph of G with a smallest number of edges that contains S. The Steiner interval I (S) of S is the union of all the vertices of G that belong to some Steiner tree for S. If S = {u, v}, then I (S) = I [u, v] is called the interval between u and v and consists of all vertices that lie on some shortest u–v path in G. T...

متن کامل

Computing Minimum Geodetic Sets of Proper Interval Graphs

We show that the geodetic number of proper interval graphs can be computed in polynomial time. This problem is NP-hard on chordal graphs and on bipartite weakly chordal graphs. Only an upper bound on the geodetic number of proper interval graphs has been known prior to

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2009

ISSN: 0012-365X

DOI: 10.1016/j.disc.2008.10.010